Labels:text | screenshot | font OCR: 1. Queue-length update: Beginning with qo := 0, if the ith event is an arrival event, q ;= 9,1+1; if the ith event is a departure event, q := q ,--- 1. 2. Queue-area (integral) update: Area of the previous cycle = Area of the current cycle = La9-1(1-1-1) ₹(71,0) 3. Average queue-length update: Average queue length over the two cycles Area of the two cycles Area of the two cycles = Time of the two cycles = t-To Figure 2: Queue-length averaging algorithm. t= current time; t ;= time of ith arrival or departure event; qi= number of frames in the system after the event; To=time at the beginning of the previous cycle; and T ,= time at the beginning of the current cycle.
